Solving the Class Responsibility Assignment Case with Henshin and a Genetic Algorithm

نویسندگان

  • Kristopher Born
  • Stefan Schulz
  • Daniel Strüber
  • Stefan John
چکیده

This paper presents a solution to the TTC2016 challenge ”The Class Responsibility Assignment Case”. Our solution uses the Henshin model transformation language to specify genetic operators in a standard genetic algorithm framework. Due to its formal foundation based on algebraic graph transformations, Henshin is well-suited to specify fundamental change patterns for genetic operators in a declarative manner. Adopting a simple, widely used genetic algorithm, we focus on effective implementation strategies for the genetic operators as well as additional operations. We analyzed our implemented strategies on the given evaluation criteria, finding a drastic impact of some configuration options on the runtime and quality of its results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the TTC'16 Class Responsibility Assignment Case Study with SIGMA and Multi-Objective Genetic Algorithms

In this paper we describe a solution for the Transformation Tool Contest 2016 (TTC’16) Class Responsibility Assignment (CRA) case study using Sigma, a family of Scala internal Domain-Specific Languages (DSLs) that provide an expressive and efficient API for model consistency checking and model transformations. Since the Class Responsibility Assignment problem is a search-based problem, we base ...

متن کامل

Locomotive assignment problem with train precedence using genetic algorithm

This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...

متن کامل

Solving the Class Responsibility Assignment Problem Using Metaheuristic Approach

Assigning responsibilities to classes is among first and arguably most important steps when creating objectoriented software design. This step depends greatly on human judgment and experience. In this paper our objective is to automatize assigning responsibilities to classes using metaheuristic optimization algorithms. Four different algorithms (simple genetic algorithm, hill climbing, simulate...

متن کامل

A Honey Bee Algorithm To Solve Quadratic Assignment Problem

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...

متن کامل

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016